Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Ioannis Anagnostides, Alkis Kalavasis, Tuomas Sandholm, and Manolis Zampetakis. On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 5:1-5:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{anagnostides_et_al:LIPIcs.ITCS.2024.5, author = {Anagnostides, Ioannis and Kalavasis, Alkis and Sandholm, Tuomas and Zampetakis, Manolis}, title = {{On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {5:1--5:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.5}, URN = {urn:nbn:de:0030-drops-195334}, doi = {10.4230/LIPIcs.ITCS.2024.5}, annote = {Keywords: No-regret learning, extensive-form games, multiplicative weights update, optimism, lower bounds} }
Feedback for Dagstuhl Publishing